Innnitary Queries and Their Asymptotic Probabilities I: Properties Deenable in Transitive Closure Logic
نویسنده
چکیده
We present new general method for proving that for certain classes of nite structures the limit law fails for properties expressible in transitive closure logic. In all such cases also all associated asymptotic problems are undecidable.
منابع مشابه
Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic
We establish a general hierarchy theorem for quantiier classes in the innnitary logic L ! 1! on nite structures. In particular, it is shown that no innnitary formula with bounded number of universal quantiiers can express the negation of a transitive closure. This implies the solution of several open problems in nite model theory: On nite structures, positive transitive closure logic is not clo...
متن کاملDeenability of Group Theoretic Notions
We consider logical deenability of the group-theoretic notions of simplicity, nilpotency and solvability on the class of nite groups. On one hand, we show that these notions are deenable by sentences of deterministic transitive closure logic DTC. These results are based on known group-theoretic results. On the other hand, we prove that simplicity, nilpotency and the normal closure of a subset o...
متن کاملDeenability and Compression
A compression algorithm takes a nite structure of a class K as input and produces a nite structure of a diierent class K' as output. Given a property P on the class K deened in a logic L, we study the deenability of property P on the class K'. We consider two compression schemas on unary ordered structures (words), a naive compression and the classical Lempel-Ziv. First-order properties of stri...
متن کاملThe Expressive Power of Transitive Closue and 2-way Multihead Automata
Correctness proof for the WAM with types p. 15 Model checking of persistent Petri nets p. 35 Provability in TBLL: A decision procedure p. 53 How to implement first order formulas in local memory machine models p. 68 A new approach to abstract data types II. Computation on ADTs as ordinary computation p. 79 A primitive recursive set theory and AFA: On the logical complexity of the largest bisimu...
متن کاملPtime Canonization for Two Variables with Counting
We consider innnitary logic with two variable symbols and counting quantiiers, C 2 , and its intersection with Ptime on nite relational structures. In particular we exhibit a Ptime canonization procedure for nite relational structures which provides unique representatives up to equivalence in C 2. As a consequence we obtain a recursive presentation for the class of all those queries on arbitrar...
متن کامل